#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5 + 10;
ll a[N];
void solve()
{
    ll n;
    cin >> n;
    for (ll i = 1; i <= n;i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    ll l = a[(1+n / 2 )/ 2];
    ll r = a[(n / 2 + 1 + n) / 2];
    ll ans = 0;
    if(l==r)
    {

    }
    else 
    {

    }
}
int main()
{
    ll t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}